Complexity results for reconstructing binary images with disjoint components from horizontal and vertical projections

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient algorithm for reconstructing binary matrices from horizontal and vertical absorbed projections

This paper studies the classical tomographical problem of the reconstruction of a binary matrix from projections in presence of absorption. In particular, we consider two projections along the horizontal and vertical directions and the mathematically interesting case of the absorption coefficient β0 = 1+ √ 5 2 . After proving some theoretical results on the switching components, we furnish a fa...

متن کامل

Reconstructing Convex Polyominoes from Horizontal and Vertical Projections

Reconstructing discrete bidimensional sets from their projections is involved in many different problems of computer-aided tomography, pattern recognition, image processing and data compression. In this paper, we examine the problem of reconstructing a discrete bidimensional set S satisfying some convexity conditions from its two orthogonal projections (H, v). We develop an algorithm that start...

متن کامل

An Empirical Study of Reconstructing hv-Convex Binary Matrices from Horizontal and Vertical Projections

The reconstruction of hv-convex binary matrices (or equivalently, binary images) from their horizontal and vertical projections is proved to be NPhard. In this paper we take a closer look at the difficulty of the problem. We investigate different heuristic reconstruction algorithms of the class, and compare them from the viewpoint of running-time and reconstruction quality. Using a large set of...

متن کامل

Reconstruction of Binary Images with Few Disjoint Components from Two Projections

We present a general framework for reconstructing binary images with few disjoint components from the horizontal and vertical projections. We develop a backtracking algorithm that works for binary images having components from an arbitrary class. Thus, a priori information about the components of the image to be reconstructed can be incorporated into the reconstruction process. In addition, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2013

ISSN: 0166-218X

DOI: 10.1016/j.dam.2013.02.004